Extremal paths and holonomic constitutive laws in elastoplasticity

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-holonomic Constraints and the Principle of Extremal Curvature

The extended variational principle fails for non-holonomic case. We use a vertical rolling disk as an example to illustrate this failure. We have studied the fundamental dynamical principle from which the motion of a mechanical system, whether holonomic or non-holonomic, can be derived.

متن کامل

Extremal Graphs for Clique-Paths

In this paper we deal with a Turán-type problem: given a positive integer n and a forbidden graph H , how many edges can there be in a graph on n vertices without a subgraph H? How does a graph look like if it has this extremal edge number? The forbidden graph in this article is a clique-path: a path of length k where each edge is extended to an r-clique, r ≥ 3. We determine both the extremal n...

متن کامل

Blurred constitutive laws and bipotential convex covers

In many practical situations, incertitudes affect the mechanical behaviour that is given by a family of graphs instead of a single one. In this paper, we show how the bipotential method is able to capture such blurred constitutive laws, using bipotential convex covers.

متن کامل

Extremal laws for the real Ginibre ensemble

The real Ginibre ensemble refers to the family of n × n matrices in which each entry is an independent Gaussian random variable of mean zero and variance one. Our main result is that the appropriately scaled spectral radius converges in law to a Gumbel distribution as n→∞. This fact has been known to hold in the complex and quaternion analogues of the ensemble for some time, with simpler proofs...

متن کامل

Extremal Functions for Shortening Sets of Paths

Let P1, . . . , Pk be k vertex disjoint paths in a graph G where the ends of Pi are xi, and yi. Let H be the subgraph induced by the vertex sets of the paths. We find edge bounds E1(n), E2(n) such that, 1. If e(H) ≥ E1(|V (H)|), then there exist disjoint paths P ′ 1, . . . , P ′ k where the ends of P ′ i are xi and yi such that | S

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quarterly of Applied Mathematics

سال: 1987

ISSN: 0033-569X,1552-4485

DOI: 10.1090/qam/910456